- equivalence partitioning
- Программирование: эквивалентное разбиение (см. Standard glossary of terms used in Software Testing)
Универсальный англо-русский словарь. Академик.ру. 2011.
equivalence partitioning
Смотреть что такое "equivalence partitioning" в других словарях:
Equivalence partitioning — is a software testing related technique with the goal: #To reduce the number of test cases to a necessary minimum. #To select the right test cases to cover all possible scenarios. Although in rare cases equivalence partitioning is also applied to … Wikipedia
Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… … Wikipedia
Stuttering equivalence — In theoretical computer science, stuttering equivalence, a relation written as:pisim {st}pi , can be seen as a partitioning of path pi and pi into blocks, so that states in the k^{mathrm{th block of one path are labeled (L(sdot)) the same as… … Wikipedia
Boundary value analysis — is a software testing design technique used to determine test cases covering off by one errors.IntroductionTesting experience has shown that the boundaries of input ranges to a software component are likely to contain defects. For instance: a… … Wikipedia
Software testing — is an empirical investigation conducted to provide stakeholders with information about the quality of the product or service under test [ [http://www.kaner.com/pdfs/ETatQAI.pdf Exploratory Testing] , Cem Kaner, Florida Institute of Technology,… … Wikipedia
Black box testing — NOTOC Black box testing takes an external perspective of the test object to derive test cases. These tests can be functional or non functional, though usually functional. The test designer selects valid and invalid input and determines the… … Wikipedia
Boundary case — The term boundary case is frequently used in software engineering to refer to the behavior of a system when one of its inputs is at or just beyond its maximum or minimum limits. It is frequently used when discussing software testing.For example,… … Wikipedia
Boundary testing — or boundary value analysis, is where test cases are generated using the extremes of the input domain, e.g. maximum, minimum, just inside/outside boundaries, typical values, and error values. It is similar to Equivalence Partitioning but focuses… … Wikipedia
DFA minimization — In computer science, more specifically in the branch of automata theory, DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has minimum number of states. Here, two DFAs are called … Wikipedia
Mathematics of Sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N}), so that each … Wikipedia
Modularity — Module redirects here. For other uses, see Module (disambiguation). Modularity is a general systems concept, typically defined as a continuum describing the degree to which a system’s components may be separated and recombined.[1] It refers to… … Wikipedia
